/**
*      author: Y_Yao
*      created: 2025-02-07 21:01:56
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 7;
int a[N];
int n,m;
unordered_map<int,int> h;

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        int x;
        cin >> x;
        if(!h.count(x))
        {
            h[x] = i;
        }
    }
    while(m--)
    {
        int x;
        cin >> x;
        if(!h.count(x)) cout << -1 << " ";
        else cout << h[x] << " ";
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}